#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<list>
#include<cstdlib>
#include<cmath>
#include<sstream>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<stack>
#define PI acos(-1)
#define MP make_pair
#define PB push_back
#define VI vector <int>
#define PII pair <int,int>
#define LL long long
#define SET(v,i) memset(v, i, sizeof(v))
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORD(i,a,b) for (int i = (a); i >= (b); i--)
#define FORN(i,a,b) for (int i = (a); i < (b); i++)
#define DOWN(i,a,b) for (int i = (a); i > (b); i--)
#define FIT(it,v) for (typeof(v.begin()) it = v.begin(); it != v.end(); it++)
#define FITD(it,v) for (typeof(v.rbegin()) it = v.rbegin(); it != v.rend(); it++)
using namespace std;
const int N=205;
//generate string into k words with word`s len in [a,b]
int k,a,b,pre[N][N];
char str[N],tmp[N];
bool dp[N][N];
vector<string>v;

int main(){
	while(cin>>k>>a>>b){
		v.clear();
		cin>>str;
		int n=strlen(str);
		memset(dp,0,sizeof(dp));
		memset(pre,-1,sizeof(pre));
		dp[0][0]=1;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=k;j++){
				for(int t=a;t<=b;t++)if(i-t>=0&&dp[i-t][j-1]){
					dp[i][j]=1;
					pre[i][j]=i-t+1;
					}
				}
			}
		if(pre[n][k]==-1){puts("No solution");continue;}
		for(int ed=n,j=k,st=pre[ed][j];ed>0;j--,ed=st-1){
			int len=0;st=pre[ed][j];
			for(int j=st;j<=ed;j++)tmp[len++]=str[j-1];
			tmp[len]=0;v.push_back(string(tmp));
			}
		reverse(v.begin(),v.end());
		for(int i=0;i<v.size();i++)cout<<v[i]<<endl;
		}
	return 0;
	}
